Decomposition Theorems for Involutive Solutions to the Yang–Baxter Equation
نویسندگان
چکیده
Motivated by the proof of Rump a conjecture Gateva-Ivanova on decomposability square-free solutions to Yang-Baxter equation, we present several other theorems based cycle structure certain permutation associated with solution.
منابع مشابه
Analytical solutions for the fractional Fisher's equation
In this paper, we consider the inhomogeneous time-fractional nonlinear Fisher equation with three known boundary conditions. We first apply a modified Homotopy perturbation method for translating the proposed problem to a set of linear problems. Then we use the separation variables method to solve obtained problems. In examples, we illustrate that by right choice of source term in the modified...
متن کاملDecay estimates of solutions to the IBq equation
In this paper we focus on the Cauchy problem for the generalized IBq equation with damped term in $n$-dimensional space. We establish the global existence and decay estimates of solution with $L^q(1leq qleq 2)$ initial value, provided that the initial value is suitably small. Moreover, we also show that the solution is asymptotic to the solution $u_L$ to the corresponding linear equa...
متن کاملAnalytical solutions for the fractional Klein-Gordon equation
In this paper, we solve a inhomogeneous fractional Klein-Gordon equation by the method of separating variables. We apply the method for three boundary conditions, contain Dirichlet, Neumann, and Robin boundary conditions, and solve some examples to illustrate the effectiveness of the method.
متن کاملSolutions of diffusion equation for point defects
An analytical solution of the equation describing diffusion of intrinsic point defects in semiconductor crystals has been obtained for a one-dimensional finite-length domain with the Robin-type boundary conditions. The distributions of point defects for different migration lengths of defects have been calculated. The exact analytical solution was used to verify the approximate numerical solutio...
متن کاملDecomposition theorems for linear programs
It is well known that any feasible arc-flow solution to a network problem defined on a graph G = (N,A), where N is the set of nodes whereas A is the set of arcs, can be expressed using at most |A| + |N | paths and cycles having nonzero flow, out of these, at most |A| cycles. This existence theorem is used in a number of proofs establishing the complexity of strongly polynomial algorithms for ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2021
ISSN: ['1687-0247', '1073-7928']
DOI: https://doi.org/10.1093/imrn/rnab232